Efficient factorization with a single pure qubit and logN mixed qubits.
نویسندگان
چکیده
It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number N requires a pure initial state. Here we demonstrate that a single pure qubit, together with a collection of log 2N qubits in an arbitrary mixed state, is sufficient to implement Shor's factorization algorithm efficiently.
منابع مشابه
A fast quantum circuit for addition with few qubits
We show how to construct a fast quantum circuit for computing the sum of two n-bit binary numbers with few qubits. The constructed circuit uses O(n/ logn) ancillary qubits and its depth and size are O(logn) and O(n), respectively. The number of ancillary qubits is asymptotically less than that in Draper et al.’s quantum carry-lookahead adder, and the depth and size are asymptotically the same a...
متن کاملEfficient Quantum Compression for Ensembles of Identically Prepared Mixed States.
We present one-shot compression protocols that optimally encode ensembles of N identically prepared mixed states into O(logN) qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops down discontinuously as soon as a nonzero error is tolerated and the spectrum of the states is known with sufficient precision. For qubit ensembles, this feature lea...
متن کاملHow entangled can two couples get ?
We describe a pure state of four qubits whose single-qubit density matrices are all maximally mixed and whose average entanglement as a system of two pairs of qubits appears to be maximal.
متن کاملSuper operator Technique in Investigation of the Dynamics of a Two Non-Interacting Qubit System Coupled to a Thermal Reservoir
In this paper, we clarify the applicability of the super operator technique for describing the dissipative quantum dynamics of a system consists of two qubits coupled with a thermal bath at finite temperature. By using super operator technique, we solve the master equation and find the matrix elements of the density operator. Considering the qubits to be initially prepared in a general mixed st...
متن کاملOn the hardness of classically simulating the one clean qubit model
Deterministic quantum computation with one quantum bit (DQC1) [E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998)] is a model of quantum computing where the input is restricted to containing a single qubit in a pure state and has all other qubits in a completely mixed state. Only the single pure qubit is measured at the end of the computation. While it is known that DQC1 can efficiently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 85 14 شماره
صفحات -
تاریخ انتشار 2000